منابع مشابه
Concurrent Construction of Proof-Nets
The functional paradigm of computation has been widely investigated and given a solid mathematical foundation, initiated with the Curry-Howard isomorphism, then elaborated and extended in multiple ways. However, this paradigm is inadequate to capture many useful programming intuitions, arising in particular in the development of applications integrating distributed, autonomous components. Indee...
متن کاملModeling Concurrent Systems: Reconfigurable Nets
The aim of this work is the modeling and verification of concurrent systems subject to dynamic changes using extensions of Petri nets. We introduce the reconfigurable nets. The expressiveness of reconfigurable nets and Petri nets is equivalent, but with reconfigurable nets we can model easily and directly systems that change its structure dynamically. The change of configuration amounts to the ...
متن کاملA Concurrent Semantics for Concurrent Constraint Programs via Contextual Nets
We propose a concurrent semantics for concurrent constraint (cc) programs. A contextual net, that is a net with context conditions, besides pre-and post-conditions, is associated to each cc program. Context conditions are items which have to be present in order for an event to take place, but which are not aaected by the event. They are very useful for describing situations where diierent event...
متن کاملNets, logic and concurrent object-oriented programming
This paper introduces a temporal logic based on precedence constraints among events which captures net semantics, i.e. a particular net can be mapped into a semantic-equivalent formula in the logic. Tempo, a declarative concurrent programming language, is based on such logic and has a procedural interpretation which allows speciications to be executed as concurrent programs. Thus, the execution...
متن کاملConcurrent processes as wireless proof nets
We present a proofs-as-programs correspondence between linear logic and process calculi that permits non-deterministic behaviours. Processes are translated into wireless proof nets, i.e. proof nets of multiplicative linear logic without cut wires. Typing a term using them consists in typing some of its possible determinisations in standard sequent calculus. Generalized cut-elimination steps in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2005
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2004.11.029